Building Irregular Graph Pyramid Using Dual Graph Contraction 1
نویسنده
چکیده
In this technical report the new version of the software Dgc tool is presented. This tool allows us to build up irregular graph pyramids by dual graph contraction. The graph pyramid consists of a stack of levels (pair of graphs), each of which has a primal level and its dual. Every successive level is a reduced version of the level below. Primal level and its dual represent a primal graph and its dual, respectively. The primal graph base level of the pyramid may represent a two dimensional image. 1This Work was supported by the Austrian Science Foundation under P14445MAT and P14662-INF.
منابع مشابه
Equivalent Contraction Kernels and the Domain of Dual Irregular Pyramids 1
Dual graph contraction reduces the number of vertices and of edges of a pair of dual image graphs while, at the same time, the topological relations among the 'surviving' components are preserved. Repeated application produces a stack of successively smaller graphs: a pair of dual irregular pyramids. The process is controlled by selected decimation parameters which consist of a subset of surviv...
متن کاملIrregular Laplacian Graph Pyramid
This paper presents a novel image representation, which incorporates the principles of Laplacian Pyramid into the irregular graph pyramid. The drawback of the regular Laplacian Pyramid is their lack to keep the topological structure of the image, due to the contraction process in building the Gaussian Pyramid. Irregular graph pyramid is able to hierarchically represent the topological structure...
متن کاملCombining regular decimation and dual graph contraction for hierarchical image segmentation
The Bounded Irregular Pyramid (BIP) is a hierarchical structure for image representation whose aim is to combine concepts from regular and irregular pyramids. The data structure is a combination of the simplest regular and irregular structures: the 2× 2/4 regular one and the simple graph representation. However, simple graphs only take into account adjacency relationships, being unable to corre...
متن کاملRooted Kernels and Labeled Combinatorial Pyramids
An irregular pyramid consists of a stack of successively reduced graphs. Each smaller graph is deduced from the preceding one using contraction or removal kernels. A contraction (resp. removal) kernel defines a forest of the initial (resp. dual ) graph, each tree of this forest being reduced to a single vertex (resp. dual vertex) in the reduced graph. A combinatorial map encodes a planar graph ...
متن کاملA revision of pyramid segmentation
Dual graph contraction reduces the number of vertices and of edges of a pair of dual image graphs while, at the same time, the topological relations among the 'surviving' components are preserved. Repeated application produces a stack of successively smaller graphs: a pair of dual irregular pyramids. The process is controlled by selected decimation parameters which consist of a subset of surviv...
متن کامل